#include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <functional>
#include <queue>
#include <stdio.h>
#include <unordered_map>
#include <unordered_set>
#include <vector>

#ifndef TEST
#pragma GCC optimize("O3", "unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,popcnt,lzcnt")
#endif
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<pii, int> piii;

// fast input
inline ll read() {
    ll X = 0, w = 0;
    char ch = 0;
    while (!isdigit(ch)) {
        w |= ch == '-';
        ch = getchar();
    }
    while (isdigit(ch))
        X = (X << 3) + (X << 1) + (ch ^ 48), ch = getchar();
    return w ? -X : X;
}

// fast output
inline void write(ll x) {
    if (x < 0)
        putchar('-'), x = -x;
    if (x > 9)
        write(x / 10);
    putchar(x % 10 + '0');
}

#define pb push_back
#define mp make_pair

/**
 * 检查密码是否符合要求
 * @param book
 * @param str
 * @return
 */
bool check(vector<int> &book, string &str) {
    for (int i = 0; i <= 9; i++) {
        if (str[i] == 'o' && book[i] == 0)return false;
        if (str[i] == 'x' && book[i] >= 1)return false;
    }
    return true;
}

void solve() {
    string str;
    cin >> str;
    int cnt = 0;
    for (int a = 0; a <= 9; a++)
        for (int b = 0; b <= 9; b++)
            for (int c = 0; c <= 9; c++)
                for (int d = 0; d <= 9; d++) {
                    vector<int> book(10, 0);
                    book[a]++;
                    book[b]++;
                    book[c]++;
                    book[d]++;
                    if (check(book, str)) {
                        ++cnt;
                    }

                }
    cout << cnt << endl;
}


int32_t main() {
    int t = 1;
    while (t--) {
        solve();
    }

}